Phylogenetic Trees Predicted by an Irreversible Markov Process
نویسنده
چکیده
A new Markovian method for the prediction of phylogenetic trees has been developed earlier by the authors. Here, the method is illustrated and applied using mitochondrial DNA data for vertebrate species (and technicalities of the theory are avoided). Discussions include the sensitivity of the results to DNA alignment techniques and the inclusion of polytomy in tree structures. Several comparisons are made with tree structures in the literature which have been predicted using statistical techniques.
منابع مشابه
Phylogenetic Trees for Vertebrate Species Predicted by an Irreversible Markov Process
A new Markovian method for the prediction of phylogenetic trees has been developed earlier by the authors. Here, the method is illustrated and applied using mitochondrial DNA data for vertebrate species (and technicalities of the theory are avoided). Discussions include the sensitivity of the results to DNA alignment techniques and the inclusion of polytomy in tree structures. Several compariso...
متن کاملAssessing the Convergence of Markov Chain Monte Carlo Methods for Bayesian Inference of Phylogenetic Trees
Assessing the Convergence of Markov Chain Monte Carlo Methods for Bayesian Inference of Phylogenetic Trees In biology, it is commonly of interest to investigate the ancestral pattern that gave rise to a currently existing group of individuals, such as genes or species. This ancestral pattern is frequently represented pictorially by a phylogenetic tree. Due to the growing popularity of Bayesian ...
متن کاملSupporting Online Material for Phylogenetic MCMC Algorithms Are Misleading on Mixtures of Trees
Markov Chain Monte Carlo algorithms play a key role in the Bayesian approach to phylogenetic inference. In this paper, we present the first theoretical work analyzing the rate of convergence of several Markov Chains widely used in phylogenetic inference. We analyze simple, realistic examples where these Markov chains fail to converge quickly. In particular, the studied data is generated from a ...
متن کاملOn the Variational Distance of Two Trees1 by M. A. Steel
A widely studied model for generating sequences is to " evolve " them on a tree according to a symmetric Markov process. We prove that model trees tend to be maximally " far apart " in terms of variational distance. 1. Introduction. In this paper we investigate sequences that have been generated on the tree by a simple Markov model. Such processes are widely-studied in molecular genetics, and i...
متن کاملDeveloping a statistically powerful measure for quartet tree inference using phylogenetic identities and Markov invariants.
Recently there has been renewed interest in phylogenetic inference methods based on phylogenetic invariants, alongside the related Markov invariants. Broadly speaking, both these approaches give rise to polynomial functions of sequence site patterns that, in expectation value, either vanish for particular evolutionary trees (in the case of phylogenetic invariants) or have well understood transf...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017